Groth-Sahai Proofs Revisited

نویسندگان

  • Essam Ghadafi
  • Nigel P. Smart
  • Bogdan Warinschi
چکیده

Since their introduction in 2008, the non-interactive zeroknowledge (NIZK) and non-interactive witness indistinguishable (NIWI) proofs designed by Groth and Sahai have been used in numerous applications. In this paper, we offer two contributions to the study of these proof systems. First, we identify and correct some errors, present in the oringal online manuscript, that occur in two of the three instantiations of the Groth-Sahai NIWI proofs for which the equation checked by the verifier is not valid for honest executions of the protocol. In particular, implementations of these proofs would not work correctly. We explain why, perhaps surprisingly, the NIZK proofs that are built from these NIWI proofs do not suffer from a similar problem. Secondly, we study the efficiency of existing instantiations and note that only one of the three instantiations has the potential of being practical. We therefore propose a natural extension of an existing assumption from symmetric pairings to asymmetric ones which in turn enables Groth-Sahai proofs based on new classes of efficient pairings.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fine-Tuning Groth-Sahai Proofs

Groth-Sahai proofs are efficient non-interactive zero-knowledge proofs that have found widespread use in pairing-based cryptography. We propose efficiency improvements of Groth-Sahai proofs in the SXDH setting, which is the one that yields the most efficient non-interactive zero-knowledge proofs. – We replace some of the commitments with ElGamal encryptions, which reduces the prover’s computati...

متن کامل

Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability

Groth, Ostrovsky and Sahai constructed a non-interactive Zap for NP-languages by observing that the common reference string of their proof system for circuit satisfiability admits what they call correlated key generation. The latter means that it is possible to create from scratch two common reference strings in such a way that it can be publicly verified that at least one of them guarantees pe...

متن کامل

An Extension of the Groth-Sahai Proof System

Non-interactive zero-knowledge proofs, particularly those constructed on top of bilinear groups, have been significantly studied in cryptography and used in a wide variety of applications in recent years. One very powerful suite of techniques for proofs over bilinear groups is the Groth-Sahai proof system, which provides efficient non-interactive witnessindistinguishable and zero-knowledge proo...

متن کامل

QA-NIZK Arguments in Asymmetric Groups: New Tools and New Constructions

A sequence of recent works have constructed constant-size quasi-adaptive (QA) NIZK argu-ments of membership in linear subspaces of Ĝ, where Ĝ is a group equipped with a bilinear mape : Ĝ×Ȟ→ T. Although applicable to any bilinear group, these techniques are less useful in theasymmetric case. For example, Jutla and Roy (Crypto 2014) show how to do QA aggregation ofGroth-Sahai ...

متن کامل

Groth-Sahai Proofs Revisited Again

The Groth-Sahai proof system (EUROCRYPT 2008, SIAM Journal of Computing 41(5) [GS12]) provides e cient non-interactive witness-indistinguishable (NIWI) and zero-knowledge (NIZK) proof systems for languages over bilinear groups and is a widely-used versatile tool to design e cient cryptographic schemes and protocols. We revisit randomization of the prover in the GS proof system. We nd an unnotic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2009  شماره 

صفحات  -

تاریخ انتشار 2009